Constructing Independent Spanning Trees on Transposition Networks
نویسندگان
چکیده
منابع مشابه
On Constructing Three Edge Independent Spanning Trees
Abstract. In this paper, we show that a prior result by Khuller and Schieber on the construction of k edge independent spanning trees in a k edge-connected graph fails under certain scenarios. We illustrate the failing of the algorithm with an example and identify the cause, which we refer to as the partial order inversion. For the case of k = 3, we develop a method to compute three edge indepe...
متن کاملNode-Independent Spanning Trees in Gaussian Networks
Gaussian network is known to be an alternative to toroidal network since it has the same number of nodes with less diameter, which makes it perform better than toroidal network. Spanning trees are said to be independent if all trees are rooted at the same node r and for any other node u, the nodes of the paths from r to u in all trees are distinct except the nodes r and u. In this paper, we inv...
متن کاملTwo counterexamples on completely independent spanning trees
For each k ≥ 2, we construct a k-connected graph which does not contain two completely independent spanning trees. This disproves a conjecture of Hasunuma. Furthermore, we also give an example for a 3-connected maximal plane graph not containing two completely independent spanning trees.
متن کاملOptimal Independent Spanning Trees on Hypercubes
Two spanning trees rooted at some vertex r in a graph G are said to be independent if for each vertex v of G, v ≠ r, the paths from r to v in two trees are vertex-disjoint. A set of spanning trees of G is said to be independent if they are pairwise independent. A set of independent spanning trees is optimal if the average path length of the trees is the minimum. Any k-dimensional hypercube has ...
متن کاملA Simple Parallel Algorithm for Constructing Independent Spanning Trees on Twisted Cubes∗
In 1989, Zehavi and Itai [46] proposed the following conjecture: a k-connected graph G must possess k independent spanning trees (ISTs for short) with an arbitrary node as the common root. An n-dimensional twisted cube, denoted by TQn, is a variation of hypercubes with connectivity n to achieving some improvements of structure properties. Recently, Yang [42] proposed an algorithm for constructi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3014822